Sinks in Acyclic Orientations of Graphs
نویسندگان
چکیده
Greene and Zaslavsky proved that the number of acyclic orientations of a graph G with a unique sink at a given vertex is, up to sign, the linear coefficient of the chromatic polynomial. We give three proofs of this result using pure induction, noncommutative symmetric functions, and an algorithmic bijection. We also prove their result that if e=u0v0 is an edge of G then the number of acyclic orientations having a unique source at u0 and unique sink at v0 is Crapo's beta invariant. 2000 Academic Press
منابع مشابه
Random acyclic orientations of graphs
II Preface This is a Master's thesis written at the department of Mathematics at the Royal Institute of Technology (KTH) in Stockholm, supervised by Svante Linusson. It is assumed that the reader has studied mathematics at an undergraduate level, and that he is well acquainted with some basic graph theory concepts such as paths and cycles. III Summary This paper is about acyclic orientations of...
متن کاملGray Code Results for Acyclic Orientations
Given a graph G, the acyclic orientation graph of G, denoted AO(G), is the graph whose vertices are the acyclic orientations of G, and two acyclic orientations are joined by an edge in AO(G) iff they differ by the reversal of a single edge. A hamilton cycle in AO(G) gives a Gray code listing of the acyclic orientations of G. We prove that for certain graphs G, AO(G) is hamiltonian, and give exp...
متن کاملCombinatorics of Acyclic Orientations of Graphs : Algebra , Geometry and Probability
This thesis studies aspects of the set of acyclic orientations of a simple undirected graph. Acyclic orientations of a graph may be readily obtained from bijective labellings of its vertex-set with a totally ordered set, and they can be regarded as partially ordered sets. We will study this connection between acyclic orientations of a graph and the theory of linear extensions or topological sor...
متن کاملMorphisms and Order Ideals of Toric Posets
Abstract: Toric posets are in some sense a natural “cyclic” version of finite posets in that they capture the fundamental features of a partial order but without the notion of minimal or maximal elements. They can be thought of combinatorially as equivalence classes of acyclic orientations under the equivalence relation generated by converting sources into sinks, or geometrically as chambers of...
متن کاملA novel evolutionary formulation of the maximum independent set problem
We introduce a novel evolutionary formulation of the problem of finding a maximum independent set of a graph. The new formulation is based on the relationship that exists between a graph’s independence number and its acyclic orientations. It views such orientations as individuals and evolves them with the aid of evolutionary operators that are very heavily based on the structure of the graph an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 80 شماره
صفحات -
تاریخ انتشار 2000